Residual Bootstrapping on Classified Tensor Morphologies using Constrained Two-Tensor Model

نویسندگان

  • Nagulan Ratnarajah
  • Andrew Simmons
  • Miguel Bertoni
  • S. Ali Hojjat
چکیده

In this study, a fast and clinically feasible residual-bootstrapping algorithm using a geometrically constrained two-tensor diffusion model is employed for estimating uncertainty in fibre orientation. Voxels are classified based on tensor morphologies before applying a single or two tensor residual-bootstrapping algorithms. Classification of tensor morphologies allows the tensor morphology to be considered when selecting the most appropriate bootstrap procedure. A constrained two-tensor model approach can greatly reduce data acquisition and computational times for whole bootstrap data volume generation compared to other multi-fibre model techniques, facilitating widespread clinical use. Tractography with two-tensor residual-bootstrapping is also developed to estimate the connection probabilities between brain regions, especially regions with complex fibre configurations. Experimental results on a hardware phantom and in vivo data demonstrate the superior performance of our approach compared to conventional approaches.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Model-Based Bootstrapping on Classified Tensor Morphologies using Constrained Two-Tensor Model

In this study, fast and clinically feasible model-based bootstrapping algorithms using a geometrically constrained two-tensor diffusion model are employed for estimating uncertainty in fibre-orientation. Voxels are classified based on tensor morphologies before applying single or two-tensor model-based bootstrapping algorithms. Classification of tensor morphologies allows the tensor morphology ...

متن کامل

Residual norm steepest descent based iterative algorithms for Sylvester tensor equations

Consider the following consistent Sylvester tensor equation[mathscr{X}times_1 A +mathscr{X}times_2 B+mathscr{X}times_3 C=mathscr{D},]where the matrices $A,B, C$ and the tensor $mathscr{D}$ are given and $mathscr{X}$ is the unknown tensor. The current paper concerns with examining a simple and neat framework for accelerating the speed of convergence of the gradient-based iterative algorithm and ...

متن کامل

New Improvement in Interpretation of Gravity Gradient Tensor Data Using Eigenvalues and Invariants: An Application to Blatchford Lake, Northern Canada

Recently, interpretation of causative sources using components of the gravity gradient tensor (GGT) has had a rapid progress. Assuming N as the structural index, components of the gravity vector and gravity gradient tensor have a homogeneity degree of -N and - (N+1), respectively. In this paper, it is shown that the eigenvalues, the first and the second rotational invariants of the GGT (I1 and ...

متن کامل

A simple form of MT impedance tensor analysis to simplify its decomposition to remove the effects of near surface small-scale 3-D conductivity structures

Magnetotelluric (MT) is a natural electromagnetic (EM) technique which is used for geothermal, petroleum, geotechnical, groundwater and mineral exploration. MT is also routinely used for mapping of deep subsurface structures. In this method, the measured regional complex impedance tensor (Z) is substantially distorted by any topographical feature or small-scale near-surface, three-dimensional (...

متن کامل

Neuron Mathematical Model Representation of Neural Tensor Network for RDF Knowledge Base Completion

In this paper, a state-of-the-art neuron mathematical model of neural tensor network (NTN) is proposed to RDF knowledge base completion problem. One of the difficulties with the parameter of the network is that representation of its neuron mathematical model is not possible. For this reason, a new representation of this network is suggested that solves this difficulty. In the representation, th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011